Broadcast scheduling in packet radio networks using mixed tabu-greedy algorithm - Electronics Letters
نویسندگان
چکیده
Introduction: The broadcast scheduling problem (BSP) is to find a collision-free scheduling of transmissions of all the stations in a minimum number of time slots. The final arrangement of the station transmissions into their allocated time slots is called a frame. Consider a packet radio network (PRN) represented by a graph G1⁄4 (V, E), where V is the set of nodes and E the set of edges. An N M binary matrix S is used to express the frame, where N1⁄4 jVj is the number of stations in the network and M is the number of time slots in the frame (i.e. the frame length). Element Sjk is one if station j is allowed to transmit in time slot k and zero, otherwise. The compatibility matrix F is defined by
منابع مشابه
Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملAn Improved Neural Network Algorithm for Broadcast Scheduling Problem in Packet Radio
Abstract— By adding a negative self-feedback to the maximum neural network (MNN), we propose a new parallel algorithm for the broadcast scheduling problem in packet radio networks. The developed algorithm introduces richer and more flexible nonlinear dynamics, and can prevent the network from getting stuck at local minima. The algorithm is verified by simulating 13 different packet radio networks.
متن کاملCross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness
This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...
متن کاملA Mixed Branch-and-bound and Neural Network Approach for the Broadcast Scheduling Problem
In this paper we proposed a mixed method to solve the broadcast scheduling problem in packet radio networks. Due to the two objectives of this problem, a twostage optimization process is adopted. In order to obtain a optimal time slot number, we use an exact method, branch-and-bound algorithm to search the whole solution space in the first stage and obtain the minimal TDMA cycle length. In the ...
متن کاملFlow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کامل